Obfuscation of Hyperplane Membership
نویسندگان
چکیده
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (point functions). In this work, we construct an obfuscator for a more complex algebraic functionality: testing for membership in a hyperplane (of constant dimension). We prove the security of the obfuscator under a new strong variant of the Decisional Di e-Hellman assumption. Finally, we show a cryptographic application of the new obfuscator to digital signatures.
منابع مشابه
روشی جدید برای عضویتدهی به دادهها و شناسایی نوفه و دادههای پرت با استفاده از ماشین بردار پشتیبان فازی
Support Vector Machine (SVM) is one of the important classification techniques, has been recently attracted by many of the researchers. However, there are some limitations for this approach. Determining the hyperplane that distinguishes classes with the maximum margin and calculating the position of each point (train data) in SVM linear classifier can be interpreted as computing a data membersh...
متن کاملPrivate Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation
Private functional encryption guarantees that not only the information in ciphertexts is hidden but also the circuits in decryption tokens are protected. A notable use case of this notion is query privacy in searchable encryption. Prior privacy models in the literature were fine-tuned for specific functionalities (namely, identity-based encryption and inner-product encryption), did not model co...
متن کاملStudies in Program Obfuscation
Program obfuscation is the software analog to the problem of tamper-proofing hardware. The goal of program obfuscation is to construct a compiler, called an “obfuscator,” that garbles the code of a computer program while maintaining its functionality. Commercial products exist to perform this procedure, but they do not provide a rigorous security guarantee. Over the past decade, program obfusca...
متن کاملObfuscating Point Functions with Multibit Output
We study obfuscation of point functions with multibit output and other related functions. A point function with multibit output returns a string on a single input point and zero everywhere else. We provide a construction that obfuscates these functions. The construction is generic in the sense that it can use any perfectly one-way (POW) function or obfuscator for point functions. Analyzing this...
متن کاملFuzzy least squares support vector machines for multiclass problems
In least squares support vector machines (LS-SVMs), the optimal separating hyperplane is obtained by solving a set of linear equations instead of solving a quadratic programming problem. But since SVMs and LS-SVMs are formulated for two-class problems, unclassifiable regions exist when they are extended to multiclass problems. In this paper, we discuss fuzzy LS-SVMs that resolve unclassifiable ...
متن کامل